Parallel Heuristics for TSP on MapReduce
نویسندگان
چکیده
We analyze the possibility of parallelizing the Traveling Salesman Problem over the MapReduce architecture. We present the serial and parallel versions of two algorithms Tabu Search and Large Neighborhood Search. We compare the best tour length achieved by the Serial version versus the best achieved by the MapReduce version. We show that Tabu Search and Large Neighborhood Search are not well suited for parallelization over MapReduce.
منابع مشابه
A Parallel Implementation of Ant Colony Optimization for TSP based on MapReduce Framewo
The Travelling Salesman Problem (TSP) is one of the most widely and deeply studied problems in optimization. It belongs to the category of NP Complete problems in which no polynomial time solution is possible unless P=NP. Various researches are done on finding efficient heuristics to get provably optimal and near to optimal results to TSP. Having the push towards grid and cloud computing, it wi...
متن کاملDistributed Simulated Annealing with MapReduce
Simulated annealing’s high computational intensity has stimulated researchers to experiment with various parallel and distributed simulated annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used ...
متن کاملImplementation of a Parallel Algorithm Based on a Spark Cloud Computing Platform
Parallel algorithms, such as the ant colony algorithm, take a long time when solving large-scale problems. In this paper, the MAX-MIN Ant System algorithm (MMAS) is parallelized to solve Traveling Salesman Problem (TSP) based on a Spark cloud computing platform. We combine MMAS with Spark MapReduce to execute the path building and the pheromone operation in a distributed computer cluster. To im...
متن کاملMoHPBGA: Multiobjective Hierarchical Population Balanced Genetic Algorithm using MapReduce
Use of heuristic methods is common to find the solutions to the optimization problems for scientific and real time. Problems such as Travelling Salesman (TSP) require more accurate solution which is tried by various optimization methods. Research in this direction shows the use of Genetic algorithms (GA) as promising candidate and is preferred over other optimization methods. Firstly due to the...
متن کاملParallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster
Traveling Salesman Problem (TSP) is one of the most common studied problems in combinatorial optimization. Given the list of cities and distances between them, the problem is to find the shortest tour possible which visits all the cities in list exactly once and ends in the city where it starts. Despite the Traveling Salesman Problem is NP-Hard, a lot of methods and solutions are proposed to th...
متن کامل